The Bregman Proximal Average
نویسندگان
چکیده
We provide a proximal average with repect to $1$-coercive Legendre function. In the sense of Bregman distance, envelope is convex combination envelopes individual functions. The mapping convexified mappings Techniques from variational analysis keys for average.
منابع مشابه
The Proximal Average: Basic Theory
The recently introduced proximal average of two convex functions is a convex function with many useful properties. In this paper, we introduce and systematically study the proximal average for finitely many convex functions. The basic properties of the proximal average with respect to the standard convex-analytical notions (domain, Fenchel conjugate, subdifferential, proximal mapping, epi-conti...
متن کاملThe NC-proximal average for multiple functions
The NC-proximal average is a parametrized function used to continuously transform one proper, lsc, prox-bounded function into another. Until now it has been defined for two functions. The purpose of this article is to redefine it so that any finite number of functions may be used. The layout generally follows that of [11], extending those results to the more general case and in some instances g...
متن کاملProximal Point Methods with Bregman Function on Riemannian Manifolds
We study the proximal point algorithm with Bregman type distance to minimize the problem , , . ) ( min S x to s x f ∈ where S is an open convex subset of a complete simply connected Riemannian manifold M of non positive sectional curvature and f is a convex function in this manifold. Introducing a strong assumption on the geodesic triangle on this manifold we obtain the convergence of the seque...
متن کاملApproximate iterations in Bregman-function-based proximal algorithms
This paper establishes convergence of generalized Bregman-function-based proximal point algorithms when the iterates are computed only approximately. The problem being solved is modeled as a general maximal monotone operator, and need not reduce to minimization of a function. The accuracy conditions on the iterates resemble those required for the classical "linear" proximal point algorithm, but...
متن کاملMultivariate GARCH estimation via a Bregman-proximal trust-region method
The estimation of multivariate GARCH time series models is a difficult task mainly due to the significant overparameterization exhibited by the problem and usually referred to as the “curse of dimensionality”. For example, in the case of the VEC family, the number of parameters involved in the model grows as a polynomial of order four on the dimensionality of the problem. Moreover, these parame...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Siam Journal on Optimization
سال: 2022
ISSN: ['1095-7189', '1052-6234']
DOI: https://doi.org/10.1137/21m1442474